Tableaux for Acceptance Logic

نویسندگان

  • Mathijs de Boer
  • Andreas Herzig
  • Tiago De Lima
  • Emiliano Lorini
چکیده

We continue the work initiated in [1–3], where the acceptance logic, a modal logic for modelling individual and collective acceptances was introduced. This logic is aimed at capturing the concept of acceptance qua member of an institution as the kind of attitude that agents are committed to when they are “functioning as members of an institution”. Acceptance logic can also be used to model judgement aggregation: it deals with how a collective acceptance of the members of an institution about a certain fact φ is created from the individual acceptances of the members of the institution. The contribution of this paper is to present a tableau method for the logic of acceptance. The method automatically decides whether a formula of the logic of acceptance is satisfiable thereby providing an automated reasoning procedure for judgement aggregation in the logic of acceptance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matteo Baldoni , Jamal Bentahar

We continue the work initiated in [1–3], where the acceptance logic, a modal logic for modelling individual and collective acceptances was introduced. This logic is aimed at capturing the concept of acceptance qua member of an institution as the kind of attitude that agents are committed to when they are “functioning as members of an institution”. Acceptance logic can also be used to model judg...

متن کامل

HyperS Tableaux - Heuristic Hyper Tableaux

Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux in [1]. In this paper we propose a new calculus called hyperS tableaux which overcomes substantial drawbacks of hyper tableaux. Contrast to hyper tableaux, hyperS tableaux are e...

متن کامل

Set theory and tableaux for teaching propositional logic

In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way semantic trees operate, linking the syntactical and semantical sides of the process. Also, it may be useful for the introduction of more advanced topics in ...

متن کامل

HTab: a Terminating Tableaux System for Hybrid Logic

Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof system, HyLoRes, is based on the resolution method. An alternative to resolution is the tableaux method, already widely used for both modal and description logics. Tableaux algorithms have also been d...

متن کامل

Goal - Directed Tableaux ∗

This paper contains a new format for analytic tableaux, called goaldirected tableaux. Their main interest lies in the fact that they are more efficient than the usual analytic tableaux (in general, they lead to less branching). They can also be used to develop an efficient tableaux-based approach to abduction. The goal-directed tableaux do not form a full decision method for propositional class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009